Fisher–Yates shuffle

Results: 42



#Item
11EVOLUTIONARY OPTIMIZATION OF LOW-DISCREPANCY SEQUENCES ´ OLIVIER TEYTAUD, FRANC ¸ OIS-MICHEL DE RAINVILLE, CHRISTIAN GAGNE, AND DENIS LAURENDEAU

EVOLUTIONARY OPTIMIZATION OF LOW-DISCREPANCY SEQUENCES ´ OLIVIER TEYTAUD, FRANC ¸ OIS-MICHEL DE RAINVILLE, CHRISTIAN GAGNE, AND DENIS LAURENDEAU

Add to Reading List

Source URL: www.genetic-programming.org

Language: English - Date: 2013-06-23 23:45:49
12Weighted Random Sampling over Data Streams  arXiv:1012.0256v1 [cs.DS] 1 Dec 2010 Pavlos S. Efraimidis Department of Electrical and Computer Engineering,

Weighted Random Sampling over Data Streams arXiv:1012.0256v1 [cs.DS] 1 Dec 2010 Pavlos S. Efraimidis Department of Electrical and Computer Engineering,

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2010-12-01 20:14:46
13Electronic version of an article published as Parallel Processing Letters, Volume 23, Issue 3, c World Scientific Publishing Company, 2013, PagesDOI: S0129626413500102 http://www.worldscientific.com/toc/

Electronic version of an article published as Parallel Processing Letters, Volume 23, Issue 3, c World Scientific Publishing Company, 2013, PagesDOI: S0129626413500102 http://www.worldscientific.com/toc/

Add to Reading List

Source URL: drpage.pagewizardgames.com

Language: English - Date: 2014-09-02 14:40:29
14Extracted from:  Mazes for Programmers Code Your Own Twisty Little Passages  This PDF file contains pages extracted from Mazes for Programmers, published

Extracted from: Mazes for Programmers Code Your Own Twisty Little Passages This PDF file contains pages extracted from Mazes for Programmers, published

Add to Reading List

Source URL: media.pragprog.com

Language: English - Date: 2015-02-03 11:00:09
15Sorting by generating the sorting permutation, and the effect on caching

Sorting by generating the sorting permutation, and the effect on caching

Add to Reading List

Source URL: www.nik.no

Language: English - Date: 2009-01-21 06:23:06
16Permutation Tests (and Sampling Without Replacement) Orders of Magnitude Faster Using SAS® John Douglas (“J.D.”) Opdyke,* DataMineIt Abstract Six permutation test algorithms coded in SAS® are compared. The fastest

Permutation Tests (and Sampling Without Replacement) Orders of Magnitude Faster Using SAS® John Douglas (“J.D.”) Opdyke,* DataMineIt Abstract Six permutation test algorithms coded in SAS® are compared. The fastest

Add to Reading List

Source URL: www.datamineit.com

Language: English - Date: 2011-01-23 12:21:21
17Bootstraps, Permutation Tests, and Sampling Orders of Magnitude Faster Using SAS® John Douglas (“J.D.”) Opdyke* Abstract While permutation tests and bootstraps have very wide-ranging application, both share a common

Bootstraps, Permutation Tests, and Sampling Orders of Magnitude Faster Using SAS® John Douglas (“J.D.”) Opdyke* Abstract While permutation tests and bootstraps have very wide-ranging application, both share a common

Add to Reading List

Source URL: www.datamineit.com

Language: English - Date: 2013-05-16 10:04:19
184  CHAPTER Combinatorics and

4 CHAPTER Combinatorics and

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2010-09-30 15:08:33
191  HOW MANY TIMES SHOULD YOU SHUFFLE A DECK OF CARDS?1 Brad Mann Department of Mathematics

1 HOW MANY TIMES SHOULD YOU SHUFFLE A DECK OF CARDS?1 Brad Mann Department of Mathematics

Add to Reading List

Source URL: www.dartmouth.edu

Language: English - Date: 2004-06-30 14:50:43
20Approximate Frequency Counts over Data Streams  Gurmeet Singh Manku  Rajeev Motwani

Approximate Frequency Counts over Data Streams  Gurmeet Singh Manku Rajeev Motwani

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2006-07-29 02:03:18